Positive factorizations of mapping classes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

C4-factorizations with two associate classes

C. A. Rodger, M. A. Tiemeyer∗, Auburn University Let K = K(a, p;λ1, λ2) be the multigraph with: the number of vertices in each part equal to a; the number of parts equal to p; the number of edges joining any two vertices of the same part equal to λ1; and the number of edges joining any two vertices of different parts equal to λ2. This graph was of interest to Bose and Shimamoto in their study o...

متن کامل

On Factorizations of Totally Positive Matrices

Different approaches to the decomposition of a nonsingular totally positive matrix as a product of bidiagonal matrices are studied. Special attention is paid to the interpretation of the factorization in terms of the Neville elimination process of the matrix and in terms of corner cutting algorithms of Computer Aided Geometric Design. Conditions of uniqueness for the decomposition are also given.

متن کامل

New infinite classes of 1-factorizations of complete graphs

Some classes of I-factorizations of complete graphs are known. They are GK2n , AK2n , W K 2n and their variations, and automorphism-free I-factorizations. In this paper, for any positive integer t, we construct new I-factorizations NtK 2n which are defined for all 2n with 2n ~ 6t. They also have some variations.

متن کامل

Matrix factorizations for reversible integer mapping

Reversible integer mapping is essential for lossless source coding by transformation. A general matrix factorization theory for reversible integer mapping of invertible linear transforms is developed in this paper. Concepts of the integer factor and the elementary reversible matrix (ERM) for integer mapping are introduced, and two forms of ERM—triangular ERM (TERM) and single-row ERM (SERM)—are...

متن کامل

C4-factorizations with two associate classes, λ1 is odd

Let K = K(a, p;λ1, λ2) be the multigraph with: the number of vertices in each part equal to a; the number of parts equal to p; the number of edges joining any two vertices of the same part equal to λ1; and the number of edges joining any two vertices of different parts equal to λ2. This graph was of interest to Bose and Shimamoto in their study of group divisible designs with two associate clas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebraic & Geometric Topology

سال: 2017

ISSN: 1472-2739,1472-2747

DOI: 10.2140/agt.2017.17.1527